Existential Second-order Logic over Strings Existential Second-order Logic over Strings – Modified March 1998 –

Existential second-order logic (ESO) and monadic second-order logic (MSO) have attracted much interest in logic and computer science. ESO is a much more expressive logic over word structures than MSO. However, little was known about the relationship between MSO and syntactic fragments of ESO. We shed light on this issue by completely characterizing this relationship for the prefix classes of ESO over strings, (i.e., finite word structures). Moreover, we determine the complexity of model checking over strings, for all ESO-prefix classes. Let ESO(Q) denote the prefix class containing all sentences of the shape 9RQ' where R is a list of predicate variables, Q is a first-order quantifier prefix from the prefix set Q, and' is quantifier free. We show that ESO(9 89 ) and ESO(9 88) are the maximal standard ESO-prefix classes contained in MSO, thus expressing only regular languages. We further prove the following dichotomy theorem: An ESO prefix-class either expresses only regular languages (and is thus in MSO), or it expresses some NP-complete languages. We also give a precise characterization of those ESO-prefix classes which are equivalent to MSO over strings, and of the ESO-prefix classes which are closed under complementation on strings. 1Institut für Informatik, Universität Gießen, Arndtstraße 2, D-35392 Gießen, Germany. Email: [email protected] 2Institut für Informationssysteme, Technische Universität Wien, Paniglgasse 16, A-1040 Wien, Austria. E-mail: [email protected] 3Electrical Engineering and CS Department, University of Michigan, Ann Arbor, MI 48109–2122, USA. Email: [email protected] An extended abstract of this paper will appear in the Proceedings of the 13th IEEE Symposium on Logic in Computer Science (LICS ’98), June 21–24, Indianapolis, Indiana, 1998. Copyright c 1998 by the authors